Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
نویسندگان
چکیده
منابع مشابه
Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
This research is motivated by a scheduling problem found in the di6usion and oxidation areas of semiconductor wafer fabrication, where the machines can be modeled as parallel batch processors. We attempt to minimize total weighted tardiness on parallel batch machines with incompatible job families and unequal ready times of the jobs. Given that the problem is NP-hard, we propose two di6erent de...
متن کاملMakespan Minimization on Parallel Batch Processing Machines with Release Times and Job Sizes
This paper investigates the scheduling problem of minimizing makespan on parallel batch processing machines encountered in different manufacturing environments, such as the burn-in operation in the manufacture of semiconductors and the aging test operation in the manufacture of thin film transistor-liquid crystal displays (TFT-LCDs). Each job is characterized by a processing time, a release tim...
متن کاملMulti-Objective Unrelated Parallel Machines Scheduling with Sequence-Dependent Setup Times and Precedence Constraints
This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...
متن کاملA New MIP Model for Parallel-Batch Scheduling with Non-identical Job Sizes
Parallel-batch machine problems arise in numerous manufacturing settings from semiconductor manufacturing to printing. They have recently been addressed in constraint programming (CP) via the combination of the novel sequenceEDD global constraint with the existing pack constraint to form the current state-of-the-art approach. In this paper, we present a detailed analysis of the problem and deri...
متن کاملEarliness-tardiness minimization on scheduling a batch processing machine with non-identical job sizes
This paper considers a scheduling problem for minimizing the sum of the absolute deviations of completion times from the due dates of all jobs (earliness-tardiness) on a single batch processing machine. For this problem, each job has a corresponding processing time and size and all jobs have the common due date. The problem under study is NP-hard and hence a hybrid genetic algorithm based on a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2017
ISSN: 0305-0548
DOI: 10.1016/j.cor.2016.08.015